Attack robustness and stability of generalized k-cores
نویسندگان
چکیده
منابع مشابه
On the robustness of random k-cores
The k-core of a graph is its maximal subgraph with minimum degree at least k. In this paper, we address robustness questions about k-cores. Given a k-core, remove one edge uniformly at random and find its new k-core. We are interested in how many vertices are deleted from the original k-core to find the new one. This can be seem as a measure of robustness of the original k-core. We prove that, ...
متن کاملReal robustness bounds using generalized stability multipliers
Su cient conditions for robust stability using generalized stability multipliers are presented for systems with sectorand norm-bounded, block-structured real uncertainty. Two parametrizations of the multiplier are considered and the robustness criteria are written as linear matrix inequalities. Upper bounds for the peak structured singular value over frequency, which eliminate frequency griddi...
متن کاملGeneralized Hyers-Ulam Stability of Generalized (N,K)-Derivations
and Applied Analysis 3 Generalized derivations first appeared in the context of operator algebras 7 . Later, these were introduced in the framework of pure algebra 8, 9 . Definition 1.1. LetA be an algebra and let X be anA-bimodule. A linear mapping d : A → X is called i derivation if d ab d a b ad b , for all a, b ∈ A; ii generalized derivation if there exists a derivation in the usual sense δ...
متن کاملGeneralized Cores
Cores are, besides connectivity components, one among few concepts that provides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based on vertex property function is presented. It is shown that for the local monotone vertex property functions the corresponding cores can be determined in time.
متن کاملSemantic Search Log k-Anonymization with Generalized k-Cores of Query Concept Graph
Search log k-anonymization is based on the elimination of infrequent queries under exact (or nearly exact) matching conditions, which usually results in a big data loss and impaired utility. We present a more flexible, semantic approach to k-anonymity that consists of three steps: query concept mining, automatic query expansion, and affinity assessment of expanded queries. Based on the observat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2019
ISSN: 1367-2630
DOI: 10.1088/1367-2630/ab3d7c